1
علوم اجتماعی و جامعه شناسی::
ماشین خودکار تعیینپذیر متناهی
Deterministic finite automaton (DFA)................................................................................. 8
Specifically, we develop a method based on a deterministic finite automaton (DFA) (39)
using the DFA is that is restricts the number of degrees of freedom in the hands of the researcher
;rather than specifying hundreds or thousands of "features" one by one, the DFA allows the
In addition to the combinatoric deterministic finite automaton (DFA) described below, we
واژگان شبکه مترجمین ایران